Positive and Horn decomposability of partially defined Boolean functions
نویسندگان
چکیده
منابع مشابه
Renamable Interval Extensions of Partially Defined Boolean Functions
Interval functions constitute quite a special class of Boolean functions for which it is very easy and fast to determine their functional value on a specified input vector. The value of an n-variable interval function specified by interval [a, b] (where a and b are n-bit binary numbers) is true if and only if the input vector viewed as an n-bit number belongs to the interval [a, b]. Renamable i...
متن کاملBest-fit Interval Extensions of Partially Defined Boolean Functions
Interval functions constitute quite a special class of Boolean functions for which it is very easy and fast to determine their functional value on a specified input vector. Their value is true, if and only if the input data viewed as an n-bit integer belongs to the interval [a, b] corresponding to the function concerned. In this paper we show, that the problem of finding an interval function, w...
متن کاملVariations on extending partially defined Boolean functions with missing bits
In this paper we consider four different definitions for an extension of a partially defined Boolean function in which the input contains some missing bits. We show that, for many general and reasonable families of function classes, three of these extensions are mathematically equivalent. However we also demonstrate that such an equivalence does not hold for all classes. 1This research was part...
متن کاملOn the Shannon Function for Partially Defined Boolean Functions
Andreev, Clementi and Rolim considered the Shannon function for partially defined Boolean functions and derived an expression for the value of this function. They proved the expression correct for a special setting of the parameters. We give an easy proof that this expression is correct in general.
متن کاملMonotone, Horn and Quadratic Pseudo-Boolean Functions
A pseudo-Boolean function (pBf) is a mapping from f0; 1gn to the real numbers. It is known that pseudo-Boolean functions have polynomial representations, and it was recently shown that they also have disjunctive normal forms (DNFs). In this paper we relate the DNF syntax of the classes of monotone, quadratic and Horn pBfs to their characteristic inequalities.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1997
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(96)00053-4